Verification of Pointer Programs Based on Forest Automata
نویسنده
چکیده
In this work, we develop an existing method for shape analysis based on so called forest automata, and we also improve its implementation, the tool Forester. Forest automata are based on tree automata and Forester includes a simple implementation of tree automata. Our first contribution is replacing this implementation by a general purpose tree automata library VATA, which contains highly optimized implementations of the used automata operations. The version of Forester using the VATA library participated in the competition SV-COMP 2015. Secondly, we have extended the forest automata based verification method with a counterexample analysis. The results of the counterexample analysis can be then used to check whether a found error is a spurious or a real one what could be used for refinement of predicate abstraction. We are currently working on its application in counterexample based abstraction refinement.
منابع مشابه
Forest Automata for Verification of Heap Manipulation
We consider verification of programs manipulating dynamic linked data structures such as various forms of singly and doubly-linked lists or trees. We consider important properties for this kind of systems like no null-pointer dereferences, absence of garbage, shape properties, etc. We develop a verification method based on a novel use of tree automata to represent heap configurations. A heap is...
متن کاملToward Symbolic Verification of Programs Handling Pointers 1 Sébastien Bardin Alain Finkel
We aim at checking safety properties on systems with pointers which are naturally infinite state systems. In this paper, we introduce Symbolic Memory States, a new symbolic representation well suited to the verification of systems with pointers. We show SMS enjoys all the good properties needed to check safety properties, such as closure under union, canonicity of the representation and decidab...
متن کاملWho is Pointing When to Whom? On the Automated Verification of Linked List Structures
This paper introduces an extension of linear temporal logic that allows to express properties about systems that are composed of entities (like objects) that can refer to each other via pointers. Our logic is focused on specifying properties about the dynamic evolution (such as creation, adaptation, and removal) of such pointer structures. The semantics is based on automata on infinite words, e...
متن کاملVerification of Programs with Complex Data
In this thesis, we discuss methods of model checking of infinite-state space systems based on symbolic verification—in particular, we concentrate on the use of the so-called regular tree model checking. As a part of our original contribution, we first present abstract regular tree model checking (ARTMC), a technique based on a combination of regular tree model checking with an automated abstrac...
متن کاملAntichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata
We propose new antichain-based algorithms for checking universality and inclusion of nondeterministic tree automata. We have implemented these algorithms in a prototype tool and we present experiments which show that the algorithms provide a significant improvement over the traditional determinisationbased approaches. Furthermore, we use the proposed antichain-based inclusion checking algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015